package Algorithms.chapter3.ch1;
import Algorithms.ST;

//顺序查找链表符号表
public class SequentialSearchST<Key,Value> {
    private Node first;
    private class Node{
        Key key;
        Value val;
        Node next;
        public Node(Key key,Value val,Node next){
            this.key=key;
            this.val=val;
            this.next=next;
        }
    }
    public Value get(Key key){
        for (Node x=first;x!=null;x=x.next){
            if (key.equals(x.key)){
                return x.val;
            }
        }
        return null;
    }
    public void put(Key key,Value val){
        for (Node x=first;x!=null;x=x.next){
            if(key.equals(x.key)){
                x.val=val;return;
            }
            first = new Node(key,val,first);
        }
    }



}
